Inverse Queries for Multidimensional Spaces
نویسندگان
چکیده
Traditional spatial queries return, for a given query object q, all database objects that satisfy a given predicate, such as epsilon range and k-nearest neighbors. This paper defines and studies inverse spatial queries, which, given a subset of database objects Q and a query predicate, return all objects which, if used as query objects with the predicate, contain Q in their result. We first show a straightforward solution for answering inverse spatial queries for any query predicate. Then, we propose a filter-and-refinement framework that can be used to improve efficiency. We show how to apply this framework on a variety of inverse queries, using appropriate space pruning strategies. In particular, we propose solutions for inverse epsilon range queries, inverse k-nearest neighbor queries, and inverse skyline queries. Our experiments show that our framework is significantly more efficient than naive approaches.
منابع مشابه
An Efficient Indexing Method for Box Queries in NDDS Spaces using BoND-tree
Similarity searches in multidimensional Non-ordered Discrete Data Spaces (NDDS) are becoming increasingly important for application areas such as bioinformatics, biometrics, data mining and E-commerce. Efficient similarity searches require robust indexing techniques. Box queries (or window queries) are a type of query which specifies a set of allowed values in each dimension. Unfortunately, exi...
متن کاملRough Isometries of Lipschitz Function Spaces
We show that rough isometries between metric spacesX,Y can be lifted to the spaces of real valued 1-Lipschitz functions over X and Y with supremum metric and apply this to their scaling limits. For the inverse, we show how rough isometries between X and Y can be reconstructed from structurally enriched rough isometries between their Lipschitz function spaces.
متن کاملEfficiently Indexing High-Dimensional Data Spaces
Indexing high-dimensional data spaces is an emerging research domain. It gains increasing importance by the need to support modern applications by powerful search tools. In the so-called non-standard applications of database systems such as multimedia, CAD, molecular biology, medical imaging, time series processing and many others, similarity search in large data sets is required as a basic fun...
متن کاملΕ-isa: an Incremental Lower Bound Approach for Efficiently Finding Approximate Nearest Neighbor of Complex Vague Queries
In our context, a complex vague query means a multifeature nearest neighbor query. Answering such queries requires the system to search on some feature spaces individually and then combine the searching results to find the final answers. The feature spaces are commonly multidimensional spaces and may consist of a vast amount of data. Therefore searching costs, including IO-cost and CPU-cost, ar...
متن کاملA Computational Framework for Inverse Queries in Statistical Learning Problems
This dissertation addresses the problem of inverting the nonlinear functions that arise in solutions to statistical learning problems. Such problems arise when inverse queries need to be answered. To provide background for the kinds of inverse queries that can arise in learning, we rst brie y present, as examples of the forward problem, the three most common learning problems arising in applica...
متن کامل